Empirical risk minimization as parameter choice rule for general linear regularization methods
نویسندگان
چکیده
منابع مشابه
Parameter choice methods using minimization schemes
Regularization is typically based on the choice of some parametric family of nearby solutions, and the choice of this family is a task in itself. Then, a suitable parameter must be chosen in order to find an approximation of good quality. We focus on the second task. There exist deterministic and stochasticmodels for describing noise and solutions in inverse problems.Wewill establish a unified ...
متن کاملComparing parameter choice methods for regularization of ill-posed problems
In the literature on regularization, many different parameter choice methods have been proposed in both deterministic and stochastic settings. However, based on the available information, it is not always easy to know how well a particular method will perform in a given situation and how it compares to other methods. This paper reviews most of the existing parameter choice methods, and evaluate...
متن کاملA Parameter Choice Method for Tikhonov Regularization
Abstract. A new parameter choice method for Tikhonov regularization of discrete ill-posed problems is presented. Some of the regularized solutions of a discrete ill-posed problem are less sensitive than others to the perturbations in the right-hand side vector. This method chooses one of the insensitive regularized solutions using a certain criterion. Numerical experiments show that the new met...
متن کاملParameter Choice Strategies for Multipenalty Regularization
The widespread applicability of the multi-penalty regularization is limited by the fact that theoretically optimal rate of reconstruction for a given problem can be realized by a oneparameter counterpart, provided that relevant information on the problem is available and taken into account in the regularization. In this paper, we explore the situation, where no such information is given, but st...
متن کاملDistributed Block-diagonal Approximation Methods for Regularized Empirical Risk Minimization
Designing distributed algorithms for empirical risk minimization (ERM) has become an active research topic in recent years because of the practical need to deal with the huge volume of data. In this paper, we propose a general framework for training an ERM model via solving its dual problem in parallel over multiple machines. Our method provides a versatile approach for many large-scale machine...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annales de l'Institut Henri Poincaré, Probabilités et Statistiques
سال: 2020
ISSN: 0246-0203
DOI: 10.1214/19-aihp966